Software production method, processing apparatus and recording medium

ABSTRACT

First, a defining member identifier constituting a screen required for software to be produced is determined. The words contained in the defining member identifier are then taken out, and a processing path diagram in which all pallets required for the software are arranged on the basis of the defining member identifier and along a flow of a process is prepared. A required file is then determined on the basis of the extracted words and prepared processing path diagram. A first base logic for editing screens or files for all of the extracted words, a second base logic for determining a processing path and a third base logic for updating a file are then prepared. Three kinds of pallets in which the first to third base logics are bound on a screen basis and pallet functions for executing these base logics autonomously and significantly in the pallets are then prepared. Then, a screen based on the pallet function concerning the first base logic is transmitted, and, after the screen has been received, the pallet function concerning the second base logic is executed. On the basis of the results of the execution of this function, the above-mentioned three kinds of pallet functions are incorporated in a pallet chain function of a structure determining one processing path out of a plurality of processing paths at least one of which comprises the execution of a pallet function concerning the third basic logic.

TECHNOLOGY FIELD

This invention is related to a production method, a processing apparatusand a recording medium applicable to all software for business, games,and all other fields.

BACKGROUND ART

How well the OS and package may be made, they cannot fulfill user'sneeds by themselves alone. Software always requires the part which usershave to develop on their own account. The key is that the softwareproduction technology must be adopted to the part. Consequently, theproduction technology must enable to realize effects such as short-termdevelopment, removal from maintenance problems, methods of connectingthe upper-stream and program specifications, guarantee of program'sfunctional quality, etc.

The prior art method is a functional division method, by whichrequirement functions are extracted to be made into software. However,in most of such cases, it is not understood that a supplemental logicwill derive from the functional division method. Besides, it goeswithout saying that this thinking method has a fundamental defect, whichcauses all problems of software to be solved. To fundamentally improvethose problems, it is necessary to introduce an new idea or a theory ofa conceptual division method that allows to confine the requirementevent, by replacing the traditional thinking method.

SUMMARY OF THE INVENTION

It is an object of the present invention to provide a softwareproduction method and system that improves programmer efficiency.

It is another object of the present invention to provide a uniformmethod of structuring software.

These and other objects of the present invention are achieved accordingto a method and system for generating software based on a user interfacecreated according to a software requirement.

Glossary of Terminology

Unit-team--not only what composes the current understanding ("realstate") of an idea (either by a person or by a computer), but also whatcomposes inner being ("true state") of an idea

Mean-space--a general term indicating three time-independent spaceswhich governs a state between real state and true state. In thiscontext, "real state" is a time-dependent space in which data codeassociated with a word is perceived as a meaning of the word; "truestate" is a time-independent space in which data code associated with aword is not yet perceived as a meaning of the word. Lyee theory dealswith what governs a stage between real state and true state.

Tense control function--the function that causes the transition betweenpallet functions. In a software embodiment, the tense control functionis implemented, for example, as a program.

Pallet--a series of tense control vectors collected that represent how asystem moves between states. In a software implementation, an exemplaryembodiment of a pallet, being represented as a series of function callsas shown in FIG. 27, is implemented, for example, as a sub-program. Itis a pallet function that functions as collecting tense control vectors.Pallet function collects tense control vectors in a fashion as depictedin FIG. 27. A pallet Duplicate vector and Homogeneity vector operate tobring about an outcome, i.e. to generate data code for self word.

Tense control vector--a general term indicating a Duplicate vector and aHomogeneity vector. In a software embodiment, the tense control vectoris implemented, for example, as a sub-routine called by a sub-program.

Duplicate vector--a sub-class of tense control vectors that duplicates(i.e., topologically propagates) data from one state to anotherneighboring state when data exists for a word. In a software embodiment,a Duplicate vector is implemented, for example, as a unit programconsisting a sub-routine.

Homogeneity vector--a sub-class of tense control vectors that allows newdata code to be associated with a word which is a minimum unit having ameaning and not a meaning itself. In a software embodiment, Homogeneityvector is implemented, for example, as a unit program consisting asub-routine. By the function of Homogeneity vector allocated to a word adata code gets associated with the self word, before the word-associateddata is displayed, for example, on a screen, and a human cognizes thedisplayed data as a meaning for the word.

The inventor contrived such a theory of a conceptual division method,and named it LYEE (GOVERNMENTAL METHODOLOGY for SOFTWARE PROVIDENCE).This theory provides the standard of a new thinking method towards thefuture.

The inefficiency of software production maintenance puts forwardsoftware production means to the production of mechanical functionpackaging that ignores the specific character of software. The softwarepackage itself is a non-correct solution type, while still requiringnonproductive development and maintenance, eventually worsening user'senvironment, including reliability, usage ability, and adaptability(RAS) functions. Needed for the present time is the preparation of theproduction base.

In this field, a solution to production technology problems has not beentried, i.e., without having the method of managing the quality ofprocess functions by the unit of the program, it has been said that thegood software can be decided only with its upper-stream concern. Hencecomes its abnormality. The software production method does notinherently belong to the characteristic allowing the separation of theupper and lower stream concerns, but we must start from the point ofgrasping it theoretically. The LYEE theory exactly satisfies it.

That is, the purpose of the invention is as follows:

(1) To improve the production ability of software developers andmaintenance personnel.

(2) To theoretically connect the upper-stream and lower-streaminformation.

(3) To provide a program structure applicable to the development for thebroad software field, including not only limited to business softwarebut also to OS, middle software, games software, etc.

(4) To minimize the upper-stream information and create a sourceprogram.

An excerpt of the following thesis of the inventor is herein introduced.

Title: JUSTIFICATION FOR BEING SOFTWARE

Subtitle: True State Structure of Software

Subtitle: A Theory of inducing a three-dimensional thinking method froma two-dimensional thinking method

The existence involves the true state and the real state. They are ruledby the unit-team of the elementary.

The true state is the origin of existence, and its unit-team will becomea unit-team representing the origin of acceptance formed by theassociation of ideas. The real state is an event represented by theduplication of the unit-team of the origin of acceptance.

The thinking method of the living body is nothing but the real state forits existence. Two unit-teams and duplicated unit-teams, which are ledto the real state, are generally called the real state unit-team, andthe action to materialize the unit-team is called theorization.

The existence recognized by the living body, for example, is merelyrelated to the real state such as that water is H₂ O, but not that thetrue state of water can be recognized. What were recognized by Newtonand Einstein were the real state, and even if they are combined, itdoesn't provide the ground for elucidating the real state of the naturalrule.

The elementary exists with its particular time, and its value is not thesame. Elementary having different time speeds cannot occupy the samemean-space. Therefore, mean-spaces occupied by them will becomedifferent.

The time speed of the elementary representing the true state must bematerialized in advance of the time speed of the real state (so to speakthe way of existence). Therefore, the unit-team representing the realstate develops in the area called the cognitive mean-space, and theunit-team representing the real state develops in the area calledcognitive mean-space but with the different time speed.

The memory is a subset of a cognitive mean-space created by the livingbody. The elementary of the cognitive mean-space exists therein. Byusing this memory, the living body creates an additional unit-team andattempts the assimilation to the existing real state unit-team. Theassimilation is an action to attempt success or failure of thecorresponding relation between two unit-teams. If the assimilatingaction is established, the real state unit-team is accepted as a memory.

The living body itself is a real state existing in the cognitivemean-space having its particular time speed. Therefore, the unit-teamcreated by the living body will become a unit-team representing the realstate. Then, the elementary of the unit-team will limitingly become anelementary existing as a memory. In other words, the living body cannot,in principle, link elementary with different time speed.

Consequently, the elementary that can be memorized by the living bodywill be limited to the elementary that can be created by the livingbody, thus the elementary representing the true state shall never beaccepted. Therefore, the recognition of the living body, as long as itis the real state created by the living body, shall never be registeredas a recognition phenomenon of the true state that was not memorized.

The elementary created by the living body will become effective with thephysical laws of the living body in accordance with its densitydevelopment, resulting in the ruling of the elementary. In other words,the living body takes the ground of choosing the ruling by the realstate rather than the true state.

If the living body is awakened to the thinking method allowing therecognition of the true state, the effect of its development shall beincomparable to the effect of the real state.

This thesis discusses the thinking method to theoretically pursue thetrue state. The purpose leads to the conclusion that the true statestructure will become the ultimate software structure to overcomesoftware problems.

Chapter 1

1.1 Logic Equation

The elementary is an independent structure based on its structuralelements such as meanings, significance and time speed. The meaning is avolition to represent the existence. This volition will be decided inthe order of its emergence. The emergence order and this volition formsthe only pair, therefore, with no others having the same qualityelementary. The unit-team order of the logic equation discussed laterrepresents this emergence order. And, this volition represents theexpansion of the mean-space.

The significance co-lives with the meaning, which is a volition toexpand the existence of the meaning. The meaning, based on thissignificance, links to the meaning of other elementary. The unit-teamdiscussed later is what is induced by the action of this volition.

The expansion action of the significance is universal. This significanceis expressed as a logical function in this theory.

The time speed is accompanied with an elementary, and by the particulartime speed of the elementary, its existing mean-space is decided. Themean-space area where the elementary exists is called the population.The consciousness mean-space and cognitive mean-space are thepopulation.

The meaning changes its being in accordance with the mean-space areawhere it exists. That is, it exists as an uniform expansion of themean-space in the consciousness mean-space having its size. In thecognitive mean-space, it exists as a diversified and multiple expansionof the mean-space. The time speed will be discussed later.

The unit-team is a row of the descending order of the expansion of themean-space of the elementary of the subsets of the population which weredecided. This row is called the descending order row. This subset iscomprised of more than one elementary belonging to the population.

The significance of the elementary is unitized by being unit-teamed.Through this process, the relationship of the sum total and duplicationof the expansion of the mean-space of the subset elementary can beestablished. If an elementary approximating to the sum total exists inthe population, it is called an elementary with the equivalence to aunit-team. The sum total, equivalence and duplication are discussedlater.

The unit-team is to materialize the emerging order of the elementaryequivalent to the unit-team. And, the logic equation is what regularizethe relationship. By using this logic equation, the further staterelating to the unit-team will be induced. When the elementaryequivalent to the unit-team is only one, the unit-team and unit-team'selementary are the one and only. When plural pieces exist, it representsto be diverse meanings. If none exists, it all becomes indefinite.

The elementary existing in the consciousness mean-space is independentof its particular time speed. Therefore, this elementary will neverexist in duplication. This elementary is called a meaning element.Naturally, its unit-team will never be duplicated. Consequently, itsunit-team will only materialize in the consciousness mean-space. As aresult, the consciousness mean-space can be ruled as the only onemean-space.

On the other hand, the elementary existing in the cognitive mean-spacecannot exist independently from its particular time speed. Therefore,this elementary exists in duplication. This is called a state element.Naturally, its unit-team will be duplicated. Consequently, its unit-teamwill only materialize in the cognitive mean-space. As a result, thecognitive mean-space is not the only one mean-space unlike theconsciousness mean-space because of its duplication ability, and itspartial mean-space will become polysemous and its whole will beindefinite. The duplication means that the expansion of the mean-spaceof the elementary is expanded in multiplicity.

The unit-team induces a further unit-team. In this relation, theelementary equivalent to a new unit-team is called an end elementary,and the elementary equivalent to the unit-team which plays anintermediary for inducing a new unit-team is called an intermediateelementary.

The unit-team materializing in the consciousness mean-space is called aconsciousness unit-team, and the unit-team materializing in thecognitive mean-space is called a transposition unit-team. Theconsciousness unit-team represents the true state of the existence,i.e., the origin of existence, and the transposition unit-teamrepresents the real state of the existence, i.e., the origin ofacceptance. For example, the representation of various real states ofwater is due to the duplication of the transposition unit-teamexpressing water. The duplicated transposition unit-team is called astate unit-team.

To materialize the transposition unit-team, it is necessary to associateideas of the consciousness unit-team and the transposition unit-team.However, the mean-space of the existence of these two unit-teams is notthe same, so the time speed is different, thus a direct association ofideas cannot be performed. For this reason, the consciousness mean-spacewill require a consciousness unit-team and a relative unit-team forassociation. The relative unit-team is what will make the consciousnessmean-space, which is not duplicable, to duplicate. That is to say thatthe consciousness unit-team makes appearance of the relative unit-teamwhich materializes the lowest-position duplication only within a certaintime duration. This time is called a transposition time. Thetransposition time is the time which is decided by the ratio between thetime speed of the elementary existing in the target consciousnessmean-space and the time speed of the elementary in the cognitivemean-space to be associated. The consciousness unit-team is associatedto the transposition unit-team via the relative unit-team.

The unique-like elementary will exist eternally, but the polysemouselementary will decay. However, if not indefinite, it will possess thepossibility of assimilating with the meaning element. The elementaryassimilating with the meaning element is called a recurrence elementary.The recurrence elementary can exist eternally the same as the meaningelement. The elementary to be indefinite will always only decay.

As already discussed, the unit-team is decided by the action of theelementary's significance. It means to decide, from the population, suchas the subset of the population, the descending order row of theelementary belonging to the subset, and the elementary equivalent to thedescending order row. The action of the significance is made to be alogic function. The following shows its algorithm.

[1] To extract elementary from the population, which respectivelyapproximate to the elementary belonging to the intermediary elementary.The approximate elementary means that the size of the expansion of themean-space represented by the elementary's significance is approximateeach other. The approximation has the size of the expansion of themean-space on the plus and minus sides, so both are extracted. When theplus and minus elementary forms into one, the only one elementary willbe extracted, however, two approximate elementary must additionally belooked for. Until the two elementary can be extracted, this action willbe continued. If not elementary to be extracted, this action terminatesat this point. When the elementary to be extracted exists polysemously,either one will be extracted optionally.

[2] To make a set of new unit-team's elementary, by adding all extractedelementary and elementary of the intermediary elementary. When theelementary belonging to the set have different populations, thepopulation with a larger number of elementary and its elementary willremain, while the population with a smaller number of elementary and itselementary will be excluded.

[3] When the same elementary exist, only one will be regularized.

[4] To make a row of the sizes of the expansion of the mean-space, inthe descending order, which are represented by the elementary of the newset. It is called a descending order row.

[5] To decide, from the population, the elementary equivalent to thedescending order row. The equivalent elementary is calculated by the sumtotal relationship. It means to be the elementary with which theunit-team approximates to the size of the expansion of the mean-space atthe plus side. The sum total relationship means: The expansion of themean-space of the elementary existing on the odd-number ranking of theelementary order in the descending order row will be absorbed into theexpansion of the mean-space of the first elementary of the elementaryorder, then, to decide the size of the expansion of the mean-space bymathematically adding the expansion of the mean-space of the elementaryexisting on the even-number ranking to the expansion of the mean-spaceof the first elementary of the elementary order.

(1) Logic Equation

    E.sub.k,R +Φ.sub.k-1 (E.sub.k-1,R +{E.sub.m }.sub.D)

The logic equation represents the relationship of the end elementaryE_(k),R induced from the logic function Φ_(k-1), which operates on theintermediary elementary E_(k-1),R and the elementary of its population{E_(m) }_(D).

The subscript K represents the unit-team order of the case when theunit-team is repeated. The unit-team order is regulated as the naturalnumber 1≦K. In this theory, the unit time of the consciousnessmean-space is grasped by the definition of the time one unit-team isinduced from the other unit-team. Therefore, the unit-team order willbecome what represents the unit time of the consciousness mean-space.The unit-team order is never duplicated, therefore it is always the onlyone.

The subscript R represents the duplication order in the case that theunit-team is duplicated. The duplication order is regulated as thenatural number 0≦R. In this theory, the unit time of the cognitivemean-space is grasped by the definition of the time one unit-team isinduced from the other unit-team. Therefore, the duplication order willbecome what represents the unit time of the cognitive mean-space. Theduplication order is polysemous. That is, in the cognitive mean-spacethe same real states will appear in the different duplication order. Theunit-team order and the duplication order will never change at the sametime. When the unit-team order changes, the duplication order will befixed by R=0, and when the duplication order changes, the unit-teamorder will be fixed.

The rephrase of the logic function Φ_(k-1) which operates on theintermediary elementary is the logic function which operates on theunit-team of the unit-team order K-1. The subscript D of the population{E_(m) }_(D) is represented by W in the case of the consciousnessmean-space and C in the case of the cognitive mean-space. The number ofthe elementary of the subset of the end elementary and the intermediaryelementary is a relationship of N_(k+1) ≧N_(k).

The logic equation can be developed as follows.

    E.sub.k,R =Φ.sub.k-1 (E.sub.k-1,R +{E.sub.m }.sub.D)

    E.sub.k-1,R =Φ.sub.k-2 (E.sub.k-2,R +{E.sub.m }.sub.D)

(2) The Real State Unit-team

The real state unit-team materializes association of ideas with threekinds of the unit-team, while materializing duplication with thetransposition unit-team, which is one of the three kinds. In thistheory, to materialize the real state unit-team, that is, to materializethe logical operation cognitively is called a solution. The solutionwill be discussed later.

01. The Cognitive Unit-team (K≧1, R=0)

The cognitive unit-team is the unit-team representing the true statewhich takes the meaning materialized in the consciousness mean-space asthe unit-team elementary. That is,

    M.sub.k,0 =Φ.sub.k-1 (M.sub.k-1,0 +{M.sub.m }.sub.w)=Φ.sub.k-1 Φ.sub.k-2 . . . Φ.sub.2 Φ.sub.1 Φ.sub.0 (M.sub.0,0 +{M.sub.m }.sub.w)

The logic function is only one. Therefore, if it is shown by Φ, thelogic function column of the above formula row is Φ^(K). Consequently,the above formula can be shown as follows.

    M.sub.k,0 =Φ.sup.K (M.sub.0,0 +{M.sub.m }.sub.w)

The M₀,0 is called a boundary condition herein.

When the consciousness unit-team is made to be software, the boundarycondition is replaced with a definitive.

If the number of the meaning element is M, the number of formation ofthe cognitive unit-team G_(M) is as follows.

    GM=M.sup.C 1+M.sup.C 2+ . . . +M-1.sup.C N-1+M.sup.C N

The symbol C represents a combination formula. The largest consciousnessunit-team is a unit-team comprised of all meaning elements of theconsciousness mean-space. When the consciousness unit-team reach to thissize, the logical operation in the consciousness mean-space will stop.

02. The Relative Unit-team (K≧1, R+1)

It is a unit-team established in the consciousness mean-space which isinduced from the consciousness unit-team in order to associate theconsciousness unit-team with the transposition unit-team. That is,

    M.sub.k,1 =Φ.sup.K (M.sub.0,1 +{M.sub.m }.sub.w)

03. The Transposition Unit-team (K≧1, P=1)

It is a unit-team with the origin of forming in the cognitive mean-spaceas the unit-team elementary which takes the state element existing inthe consciousness mean-space that is associated from the relativeunit-team. When the association is established, the population isreplaced from the consciousness mean-space to the cognitive mean-space.That is,

    S.sub.k,1=Φ.sup.K (M.sub.0,1 +{S.sub.m }.sub.c)

When the association of the transposition unit-team cannot be completedwithin the transposition time, the living body will choose with toabandon this association or to alternatively create it by usingmemorized information. However, it is clear that the transpositionunit-team created will not obey the rule of the logical operation. Withthis viewpoint, the creation by the living body is polysemous, hencefalse. In other words, the human civilization can be interpreted asaiming towards the limit of the false.

04. The logic Equation of the State Unit-team (K=fixed, R≧2)

It is a unit-team representing the real state which is associated fromthe duplication of the transposition unit-team.

    S.sub.k,R =Φ.sup.K (M.sub.0,1 +{S.sub.m }.sub.c).sup.R

Therefore, the end elementary of the state unit-team will represent avariety of its real state in accordance with its duplication level. Theduplication order R will operates on the transposition unit-teamdecided. The structure of the state unit-team is different fromunit-teams, and it means that the expansion of the mean-space of theelementary belonging to the transposition unit-team will be multiplex.For example, the various representation of the original elementary ofwater is due to the difference in the level of the duplication of thetransposition unit-team. The elementary of the state logic created bythe living body is represented into the phenomena such as consciousness,feeling, language, composition, attitude and conduct.

05. The Recurrence Logic (omitted)

(3) Logical Operation

The logical operation is what associates the consciousness unit-team,the relative unit-team and the transposition unit-team with theirduplicated state unit-teams.

The following is the logic equation inducing the relative unit-team fromthe transposition unit-team.

    M.sub.0,1 =Φ.sup.-K (S.sub.k,1 +{M.sub.m }.sub.w)      (1)

The relationship of the transposition unit-team and the state unit-teamis as follows.

    S.sub.k,R =(S.sub.k,1).sup.R                               (2)

Therefore,

    S.sub.k,1 =(S.sub.k,R).sup.-R                              (3)

Formula (1) is revised by substituting formula (3) for formula (1). Thatis,

    M.sub.0,1 =Φ.sup.-K ((S.sub.k,R).sup.-R +{M.sub.m }.sub.c)(4)

The living body can only perceive the state unit-team. Therefore, theformula (4) is used as the logic equation for obtaining thetransposition unit-team from the state unit-team decided by theduplication order R by using formula (3) and then to obtain theconsciousness unit-team from the aforementioned transposition unit-team.The reciprocal logic functions represented by formula (1) and formula(2) can always be established and obtained because the logic function isuniversal. As a result, if the elementary of the consciousnessmean-space can be assumed, the consciousness unit-team existing thereincan be obtained. The formula (4) is called a reciprocal logic function.The solution is nothing but this operation.

1.2 Time Providence (Refer to FIG. 23.)

The time to decide the consciousness logic is regarded as the unit timeof the consciousness logic. The time to duplicate the transposition timeis regarded as the unit time of the cognitive mean-space. The unit-teamorder in the consciousness mean-space is the only one or alike. Thecognitive mean-space is partially established and indefinite as a whole.Therefore, the duplication order in the cognitive mean-space will bedetermined per partial mean-space and become polysemous.

Considering the fact that the unit time will change per individualsituation, the specific time of the elementary grasping by the absolutetime is represented by the reciprocal number of the unit time and calledthe time speed.

The state unit-team assimilates and becomes a memory of the living body,and the memory is presented in the form of feeling, language, conductand documents, etc. However, before it occurs, the consciousnessunit-team, which is its origin, must have already been established andexisting. That is, it is necessary that the time speed required for theformation of the consciousness unit-team must be greater than the timespeed required for the formation of the state unit-team.

The unit time, the time speed, the transposition time and the recurrencetime are called the time providence in general. The following are thedefinition.

(1) Unit Time

Unit time to decide the consciousness unit-team: t_(U) (M_(k),0)

Unit time to decide the state unit-team: t_(U) (S_(k),R)

Unit time relation of two mean-spaces: t_(U) (M_(k),0)<<t_(U) (S_(k),R)

(2) Time Speed

Time speed of the consciousness unit-team:

    t.sub.v (M.sub.k,0)=1/t.sub.U (M.sub.k,0)

Time speed of the state unit-team:

    t.sub.v (S.sub.k,R)=1/t.sub.U (S.sub.k,R)

Time speed relation of two mean-spaces:

    t.sub.v (M.sub.k,0)>>t.sub.v (S.sub.k,R)

A large elementary of the time speed exists independently. A smallelementary of the time speed cannot exist independently.

(3) Transposition Time

Transposition time in the cognitive mean-space:

    t.sub.T t.sub.V (M.sub.k,0)/t.sub.V (S.sub.k,R)

(4) Occurrence Time (omitted)

Chapter 2

Software Solution

The solution to the reciprocal logic equation to induce theconsciousness unit-team, that is,

    M.sub.0,1 =Φ.sup.-K ((S.sub.k,R).sup.-R +{M.sub.m }.sub.c)

can be established concerning specified cognitive events (stateunit-teams). In this chapter, the solution how to operate specifiedcognitive events on a computer as software will be discussed. Thissolution theory is called a software solution. The reciprocal theoryequation to be revised by the software solution is called a scenariofunction. The scenario function will be discussed in Chapter 3. Thescenario function will end in representing the one and only likestructure of the software. Therefore, in this theory the softwaredevelopment work will end in jobs fulfilling this scenario function. Inother words, the jobs will become the same quality work as embodyingconditions appearing through the process of the software solution.Because it is to grasp the strict proposition of the work which shalldecide conditions appearing through the solution process. Normally, thethinking method that can be standardized is generally rephrased as themethodology. With this theory, the thinking method used forconcreteness, or its proposition itself, is the one like the knowledgeof experience, but is that is grasped through the logical process calledthe solution. Therefore, an efficiently high ratio of thestandardization can be attained, when compared with traditionalapproaches.

Chapter 3

The Development Methodology

The method to materialize the software solution into a developmentmethodology is discussed herein.

The traditional software is to program, by using system engineer (SE)'spersonal ability (experience, knowledge and application), requirementevents, i.e., state unit-teams, while functionally regulating them inadvance. In this instance, a computer assumes a role of reproducing thestate unit-team as information within a short time, which was treated asan already-known fact by SE. This means that traditional programs existfor reproducing the already-known state within a short time on acomputer, thus without a ground for producing a new state unit-team.Therefore, the new state unit-team will only have to depend on thelogical operation of the living body, which will act on impulse of theinformation reproduced by a computer. things.

To realize this theory to be a development methodology is aimed tocreate a program representing the consciousness unit-team on paper(cognitively). Then, by structurally duplicating the program on acomputer, it aims to bring forth the state unit-team associated with theconsciousness unit-team onto a computer.

So to speak, the requirement event is the state unit-team, which alwaysexists polysemously (CHAOS) Therefore, the self-conclusion by therepetition (collusion) indicates the tendency towards easy assimilation,however, fundamental defects existed in terms that it resulted inbecoming non-productive on the premise that the duplication unit-team ofthe formation origin be created.

Consequently, the formation of the state unit-team of the requirementevent is only by means of prior regulation. Hence, it was basicallyimpossible to render this role to a computer. For example, animagination of attempting to induce it deductively, which is representedby so-called AI, is simply not what can go over a commercial and wishfulimagination. This theory presents an induction method which enables theuse of a computer for handling this problem as an alternative means.

The structure of the program grasping the consciousness unit-team whichis induced by this theory will take a remarkably simplified form, whencompared with the structure grasping the state unit-team. As a result,human works for deciding the software producing the consciousnessunit-team will also be simplified eventually. As a result, effects withremarkable improvements are brought forth to the work concerned with thedevelopment and maintenance of software. Major points of such effectsare presented in the following.

(1) 50% of the SE works, traditionally essential, will becomeunnecessary.

(2) Logical operation by the parties concerned can be reduced broadly.That is, only 10% or so of the traditional human work of grasping thestate unit-team could be mechanized. 90% of the work was inevitablyrendered to individual personnel's ability. In the case of this theorywhich grasps the consciousness unit-team, 70% of the work can bemechanized.

(3) The logical part of the source program based on the traditionalmethod can be compressed to 20%.

(4) The upper and lower-stream processes based on the traditional methodcould only be associated by programmer's self logical operation, soconcerns of these processes were difficult to be understood by peopleexcept parties concerned. For this reason, the productivity of themaintenance work lowered to the level of one-tenth the productivity ofthe development work, which was already low. In the case of this theory,the upper and lower-stream relation can be theoretically associated,therefore programmer's personal logical operation will becomeunnecessary for this part. In other words, the relation isn't what ispsychogenically buried any more, and by understanding the theoreticalstructure of this theory, anyone will become able to command the samelogical operation. As a result, the productivity of the maintenance workwill be able to be improved by leaps and bounds.

(01) Scenario Function

The reciprocal logic equation with a solution of software using themean-space model, which is discussed later represents a structure of theconsciousness unit-team of the software. The structure of theconsciousness unit-team will universally become only one, therefore thesoftware structure of this instance will inevitably become only one. Itis called a scenario function.

The following is the scenario function which takes a screen as the basedefinitive.

    T.sub.0 =Φ.sub.0 ({Φ.sub.p,k {L.sub.i,2,T.sub.l,f }}+{Φ.sub.p,k {L.sub.i,3,T.sub.l,g }}+{Φ.sub.p,4 {L.sub.i,4,T.sub.l,q }})

in which

The Φ₀ represents the tense control function which takes the basedefinitive as a frame.

The Φ_(p),k represents the pallet function. The subscript k representsthe frame identifier.

The L_(i),2 represents the tense control vector of the semantic area WO2of word i.

The L_(i),3 represents the tense control vector of the semantic area WO3of word i.

The L_(i),4 represents the tense control vector of the semantic area WO4of word i.

Word i of WO2, WO4 represents the word existing in frame k.

Word i of WO3 is all words existing in the system.

The T_(l) is the scenario function taking the base definitive as a file,and it associates with traditional type programs. The subscripts f, g, qrepresent the file identifier.

That is, the T_(l) is also the scenario function taking the basedefinitive as a file. It is a tense control function Φ₁ in thisinstance. That is,

    T.sub.1,f =Φ.sub.1 ({Φ.sub.p,k {L.sub.j,2 }}+{Φ.sub.p,k {L.sub.j,3 }}+{Φ.sub.p,4 {L.sub.j,4 }})

in which

The L_(j),2 represents the tense control vector of the semantic area WO2of word j.

The L_(j),3 represents the tense control vector of the semantic area WO3of word j.

The L_(j),4 represents the tense control vector of the semantic area WO4of word i.

Word j of WO2, WO4 is the word existing in file f.

Word j of WO3 is all words existing in the system.

(2) Mean-space Model (See FIGS. 24, 25, 26.)

The software is a relationship representing the relation of the real andtrue states of the existence.

The software development resides in establishing the real stateunit-team. Ideally, it returns to establishing its consciousnessunit-team. However, the consciousness unit-team is unknown forever, andin order to establish its consciousness unit-team, it is necessary toestablish the inverse association which induces the consciousnessunit-team from the state unit-team.

The indispensable condition required therein is to express thestructural establishment of the cognitive mean-space and theconsciousness mean-space by the only one mean-space. In this theory,this mean-space is called a mean-space model. The mean-space model mustbe induced from the solution conditions appearing during the process ofthe software solution. Therefore, the software will return to themean-space model, and the software development takes the same meaning asthe work deciding this mean-space model. The structure of the mean-spacemodel is discussed in the following.

The regulation of the cognitive mean-space expressed by the solutionconditions are classified to reception, logic and relativity. Thisregulation is replaced with the two dimensional areas of three kinds. Itis called a semantic area in general. The semantic area is expressed byWO2, WO3, WO4, and The WO2 represents reception. The WO3 representslogic. The WO4 represents relativity.

On the other hand, the regulation of the consciousness mean-space can bereplaced with the three dimensional mean-space concept having areciprocal association with the semantic area. That is, the mean-spacemodel represents the cognitive mean-space with the unit-team of thesemantic area, and it takes the structural body representing thecognitive mean-space in the three dimensional mean-space. Then, thesemantic element discussed in this theory cannot be materializedcognitively, so the semantic element shall be replaced with a word.Consequently, the word is placed in the three dimensional mean-spaceformed by the semantic area. And, the word is transposed (vectoranalysis) into the semantic area, and its meaning is replaced with thetense control vector (program) in accordance with its own regulation.The tense control vector will be discussed later. In this connection, asfor the traditional program, the meaning of the requirement event wasmade into the specification by using experience and knowledge, and itwas made to be a logic. As for the tense control vector, the respectiveregulations of the semantic area take the form of the specificationwhich replaces the meaning of words with tense control vector, insteadof experience and knowledge.

When this tense control vector is unit-teamed per area, it turns out tobe the functional elementary equivalent to the cognitive-staterequirement event. The association already discussed means thecorresponding relationship of the functional elementary can beestablished, which is materialized by the areal unit-team of the meaningof the word and its tense control vector. The areal unit-team means toassign the order in the semantic area, and theoretically, its form hasthree kinds.

However, when it is implemented as the development methodology, it takesfive forms or kinds due to the law of the computer. The related order isshown in the homogeneity map to be discussed later. This order regulatesthe condition of the formation of the reciprocal association whichinduces the true state from the real state's requirement event.

The regulation of the semantic area is already known as the solutioncondition, and by replacing the word existing in the system with thesemantic element, it will satisfy the tense control vector. And, whenthe areal unit-team of the semantic area is realized by using the threeforms, where the tense control vector exists, any elementary can all beregulated by the combination of these three forms. Thus, from thestructure of this mean-space model, the reciprocal association can beestablished for inducing the consciousness unit-team.

(3) Tense control vector (See FIG. 27.)

The word existing in the system shall be replaced with the semanticelement existing in the cognitive mean-space. As the semantic element ismade into the subset in accordance with its significance, the word ismade into a set by the definitive. And, as the set semantic element isunit-teamed in accordance with its significance, the word on thedefinitive is unit-teamed by the life operation, and establishes therequirement event. For example, the display establishes the unit-team tothe living body by using the word on its screen. The table establishesthe unit-team to the living body by using the word on its table. Thefile establishes the unit-team to the living body by using the word onfile. In terms of establishing the unit-team to the living body, thedefinitive can well be the requirement event.

If the software is positioned to be a means to replace the lifeoperation, roles of -he software are explained as follows: Itsupplements new words in order to establish the unit-team of the word,which cannot be attained only by the word existing in the definitive.With the traditional software, the decision of such new words and theirunit-team were handled by SE in advance. However, the software inducedby this development methodology will handle this process just by itself.Additionally speaking, the software in essence must be of this sort.

As already discussed, the tense control vector is what has been replacedinto the program by the regulation of the semantic area of the set wordtransposed to the semantic area. That is, the tense control vector isthe program regulated by the definitive, the word, and the transposedsemantic area.

And, it assumes the role for replacing the transposed word's meaning bythe regulation of the transposed semantic are, then setting to it to itsword address. The meaning set to the word address is decided by the twomethods in order to establish the semantic area's unit-team which willproduce functions. One method is to topologically set the meaning of thesame word existing in other semantic areas. The other is to set bydeductively inducing from the meaning of other words of the samesemantic area. This operation can be satisfied by fulfilling either ofthe methods. And, if both can be established, the former will have thepriority. The former is called the duplicate vector, and the latter iscalled the homogeneity vector.

In the case that all words on the definitive are transposed to thesemantic areas and replaced with the tense control vector, this semanticarea is called a pallet. The pallet will make a set of the tense controlvector by using the pallet function which is discussed later. The tensecontrol vector on the pallet will prepare for execution, for example,being made into a sequential list by the CALL command. This listingrequires the sequence of the groups of the duplicate vector and thehomogeneity vector, but the in-group sequence isn't required.

Additionally speaking, the pair of the CALL and the tense control vectorwill become equivalent to the pair of the command part and the OPERANDpart of the machine language. This means that the tense control vectoris equivalent to the OPERAND function. In this sense, the tense controlvector is not a program representing traditional functions, but thelogic to control the word address existing in the semantic area. Itprovides one of the grounds of an argument that the program can becreated by the logic. The specification which replaces the meaning ofthe word by the regulation of the transposed semantic area provides theground that the specification of the requirement function, astraditionally needed as the semantic area's regulation itself, isunnecessary. The regulation of the semantic area is discussed herein,which is the specification condition of the programming.

(1) Reception (WO2)

In corresponding to the cognitive action performed by the lifeoperation, this regulation is used to decide the process route of thereciprocal association in order to create the consciousness unit-team.Not discussing merits and demerits, but the latest OS doesn't requirethe duplicate vector of this semantic area. The homogeneity vectordecides the process route.

In the case that the cognitive operation and the file are directlyconcerned, the memory operation discussed on WO3 will be executed inplace of WO3. (See FIG. 28.)

(2) LOGIC (WO3)

This regulation is used to make the meaning of the word to be a logic.The formation of the logic and the end of its consciousness unit-team isthe same definition. The end consciousness unit-team is memorizedinevitably. The memory in this instance means to make the consciousnessunit-team into a file. In this connection, the journal output has thesame meaning as this memory. The memory operation can be processed bythe traditional program, but its functional decision will become anunwilling work from the software viewpoint, thus, this developmentmethodology also deals with this problem.

The duplicate vector fetches information required for forming a logicfrom the WO2's semantic area. This operation cannot be executed when noinformation exists in the WO2. When no information exists in its ownword address, the homogeneity vector does the induction by usinginformation of other word address, not of its own, existing in the sameWO3. When the principle to establish the induction and information ofthe necessary word address do not exist, the action cannot beaccomplished. (See FIG. 29.)

(3) Relativity (WO4)

The unit-team additionally makes another unit-team, representing a newelementary. This semantic area handles the regulation to make additionalunit-team of the consciousness unit-team. In the case that the semanticarea reflects the screen information, this semantic area does screenediting for output. In the case of the file information, it does fileediting for output.

The duplicate vector fetches information needed to edit from thesemantic area of WO2, WO3. If no information is available, the actioncannot take place. When the information exists in both semantic areas,the information of WO2 takes priority. The homogeneity vector inducesinformation needed for editing from the information of the of the wordaddress in the same WO4, but not of its own address. When the principleto establish the induction and the information of the necessary wordaddress are not available, this action cannot be accomplished. (See FIG.30.)

(4) Pallet (See FIG. 31.)

The word existing in the consciousness mean-space is made to a set perdefinitive. Similarly, the tense control vector is made to be a set perdefinitive. The pallet is this set of the tense control vector. That is,the pallet is the set of the tense control vector distinguished by thedefinitive and the three kinds of the semantic areas. The pallet buildsthe structure of the tense control vector by the pallet function. Thestructure of the pallet function of only one, but it is needed perpallet.

(5) WT Unit

The traditional requirement event is regulated by the definitive. Thedefinitive organized functionally is called a WT unit(WALK-THROUGH-UNIT).

(6) Tense Control Function (See FIGS. 32, 33.)

The tense control function is used to rule the mean-space model, and itis the logic to give the sequence to the semantic area for inducing theconsciousness unit-team. There are two kinds of the tense controlfunction represented by Φ₀ and Φ₁. The former treats the base definitiveas the screen, and the latter treats the file as the base definitive.Further to add, the latter is established as the partial mean-space ofthe former.

(7) Homogeneity Map

The definitive which is set by the WT unit can be rewritten into thehomogeneity map. The homogeneity map and the tense control function areequivalent, with the only difference in their expression. That is, thetense control function is a program, and will become the specificationqualified to be called a design drawing. The homogeneity map is the onlyone formatted screen which can be decided at the initial stage ofstarting works.

The homogeneity map can cover 40% of the whole collection of documentstraditionally needed such as requirement definition, basic and detaildesigns, program specifications, text specifications, operation manual,development management materials

Additional Rules

FIG. 23 is a diagram which explains the time providence. The expansionof the unit time to be established in the same mean-space (the sum totaltime of the solution) represents the depth of the mean-space.

FIG. 24 is a diagram which explains the mean-space model and its duplexstructure.

Supplement

This diagram shows the structure of the mean-space model of the casethat even the traditional type of programs appearing on the pallet ofthe tense control function Φ₀, which treats the base definitive as thescreen, can also be treated to be suitable to LYEE. That is, thetraditional type of programs (plural) are replaced with T₁ by the tensecontrol function Φ₀ (plural) which takes the base definitive as a file,and will form the structure ruled by the pallet of the Φ₀ from which theprogram appeared.

01. Scenario Function which takes the tense control function Φ₀ as ahomogeneity map

    T.sub.0 Φ.sub.0 ({Φ.sub.p,.sub.k {L.sub.i,.sub.2,T.sub.l,.sub.f }}+{Φ.sub.p,.sub.k {L.sub.i,.sub.3,T.sub.l,.sub.g }}+{Φ.sub.p,.sub.k {L.sub.i,.sub.4,T.sub.l,.sub.q }})

02. Scenario Function which makes traditional type of programs, whichtake the tense control function Φ₁ as a homogeneity map, to be suitableto LYEE

    T.sub.1,f =Φ.sub.l (Φ.sub.p,.sub.f {L.sub.j,.sub.2 }+Φ.sub.p,.sub.f {L.sub.j,.sub.3 }+Φ.sub.p,.sub.f {L.sub.j,.sub.4 })

03. The k is the screen identifier. The f, g, q are the fileidentifiers.

04. The homogeneity map Φ₀ is expressed by the five kinds of the processroute taking the screen as a base.

05. The homogeneity map Φ₁ is expressed by the three kinds of theprocess route taking the file as a base.

FIG. 25 is a diagram which explains the relationship of the word and themean-space model.

Supplement

The word existing in the mean-space model is ruled by the basedefinitive and transposed to the semantic area. The word transposed toWO2, WO3 are ones existing thereabouts together with the basedefinitive. The word transposed to WO3 has no relation to the basedefinitive, and all words existing in the mean-space model aretransposed. The base definitive represents a screen when the tensecontrol function is Φ₀ and a file when it is Φ₁. The screen word shownin the table means the word existing in the screen, the file word meansthe word existing in the file, and the journal word means the wordexisting in the journal.

FIG. 26 is a diagram which explains the logic structure.

Supplement

This diagram shows the pallet's area concept and its co-existing logic,that is, the relationship of the tense control vector and thetraditional type program P. In this connection, the traditional programis made to be suitable to LYEE by the tense control function Φ₁, but itis not shown in this diagram.

01. The FILES, a reference family used by the tense control vector, arenot shown.

02. The solid line BOX and the bold dot line BOX indicate the operandarea which configures the logic of the tense control vector.

03. The bold dot BOX indicates the data process area (BUFFER) for thetraditional program.

04. The traditional program P and its data process area are defined bythe number of the definitive (screen, journal, file).

05. The maximum number of the pallet is 3×G (the number of the screen).

06. The number of the solid line BOX is 3×W as defined by the number (W)of the word (a) existing in the system.

07. The number of the tense control vector is the number of the solidline BOX which is depended on the word existing in the mean-space modelto be defined.

08. The pallet is generalized by the pallet function (Φ₀), taking thetense control vector and the traditional program as its element.

09. The pallet is ruled by the tense control function (Φ₀).

10. The logic induced by the tense control function (Φ₀) is called thescenario function (T).

11. The boundary condition in the case that a PKG software pre-assembledas an execution environment is used is regulated by the traditionalprogram.

12. The slim dot line BOX indicates the area of the route specifyinginformation used by the tense control function.

13. The bold dot line BOX is called WFL.

FIG. 27 is a diagram which explains the meaning of the tense controlvector.

01. The pallet is a set unit of the tense control vector regulated bythe pallet function. It is a program by itself.

02. The order of the tense control vector to be placed in the pallet canbe in no special order by the nature of its logic structure.

03. The relationship of the CALL and the tense control vector is, bystructure, that the CALL matches to the machine language's command partand the tense control vector matches to the operand.

04. The machine language's command operates on the operand, and theoperand means the information which indicates the data area addressrequired by the command.

05. Based on this relation, the tense control vector assumes thecontents as follows: (1) to decide the address of the data areanecessary to the command process; (2) to execute the operation takingthe place of the CALL decided from the address information; (3) to setthe result in the aimed address.

06. The data area address necessary to the command process becomes clearnaturally from the transposed word information existing in the semanticarea.

07. The operation in the place of the CALL is naturally decided from theuniversal rule imposed to the semantic area (the paradigm of the tensecontrol vector) and the significance of the word (operational ability).

08. The traditional program used inside the tense control vector mustdefine its particular data area by itself.

09. Even when the tense control vector is the traditional program, itcan use the data area of the semantic area in the same manner as thetense control vector, if it is placed in the pallet with the relation ofthe tense control vector.

Remarks: The relation to the theoretical words

01. The Scenario function (T) is the same definition as the semanticunit-team.

02. The pallet is what represents the semantic area when the wordexisting in the semantic area is replaced with the tense control vector.

03. The semantic unit-team represents the origin of existence of therequirement event which is established in the cognitive mean-space, thatis, the logic expressing the true state.

04. The structure of the semantic unit-team will become only constantly.In other words, the structure paradigm of the software is also the onlyone.

05. It is all things in nature, in which the semantic unit-teamassociates the transposition unit-team after the relative unit-team andthe duplication of the transposition consequently exists in thecognitive mean-space.

06. All things in nature mean the real state and the state unit-team.

07. The requirement event means a part of all things in nature.

08. The transposition unit-team means the unit-team representing theorigin of existence.

09. The duplication of the transposition unit-team means the frequencygiving a data value to the unit-team element of the transpositionunit-team.

10. The duplication of the transposition unit-team means the duplicationof the scenario function (T^(n)).

FIG. 28 is a diagram which explains the column (WO2) of the tensecontrol vector.

Word: Sales (The item existing on the screen)

FIG. 29 is a diagram which explains the column (WO3) of the tensecontrol vector.

Word: Sales (The item existing on the screen)

FIG. 30 is a diagram which explains the column (WO4) of the tensecontrol vector.

Word: Sales (The item existing on the screen)

FIG. 31 is a diagram which explains the pallet function (Φ_(p)).

Supplement

The pallet function is a tense control vector, that is, a logic whichforms the pallet by making a set of the duplicate vector and thehomogeneity vector.

01. The pallet function is driven from the tense control function andreturns.

02. The open and close of the indication of the file can be portionedout to the tense control vector depending on the relation to anexecution equipment environment.

03. The simplest pallet function is a column of the CALL statement.

04. The pallet re-start flag is the pallet function-specific area.

FIG. 32 is a diagram which explains the tense control function (Φ₀, thebase definitive=screen)

Supplement

01. The concept diagram of the unit-team

02. The tense control function and the homogeneity map are of the samequality.

03. The blank box of the flow must be ignored.

FIG. 33 is a diagram which explains the tense control function (Φ₀, thebase definitive=file).

Supplement

01. The tense control function and the homogeneity map is of the samequality.

02. The blank box of the flow must be ignored.

BRIEF DESCRIPTION OF DRAWINGS

FIG. 1 shows the work process based on this invention.

FIG. 2 shows the screen to input sales.

FIG. 3 shows the screen to refer to customer codes.

FIG. 4 shows the screen to input the confirmed product's arrival.

FIG. 5 shows the screen to refer to warehouse codes.

FIG. 6 shows the screen to execute the output operation of a deliveryrequest list.

FIG. 7 shows the journal of a delivery request list.

FIG. 8 shows the journal of a delivery request list.

FIG. 9 shows the homogeneity map for the "sales input."

FIG. 10 shows the homogeneity map for the "confirmed product's arrivalinput."

FIG. 11 shows the homogeneity map for the "delivery list."

FIG. 12 shows an example of the WO4 duplicate vector.

FIG. 13 shows an example of the WO4 homogeneity vector.

FIG. 14 shows an example of the WO2 homogeneity vector.

FIG. 15 shows an example of the WO2 homogeneity vector.

FIG. 16 shows an example of the WO3 duplicate vector.

FIG. 17 shows an example of the WO3 homogeneity vector.

FIG. 18 shows the structural diagram of the pallet function.

FIG. 19 shows the structural paradigm of the tense control function.

FIG. 20 is a diagram to explain the scenario unit-team.

FIG. 21 shows the method of creating the traditional software.

FIG. 22 shows the conceptual structure of the program concerned withthis invention.

FIG. 23 is a diagram which explains the time providence concerned withthis invention.

FIG. 24 explains the mean-space model and its duplex structure concernedwith this invention.

FIG. 25 explains the relation of the word and the mean-space modelconcerned with this invention.

FIG. 26 is a diagram which explains the logic structure concerned withthis invention.

FIG. 27 explains the meaning of the tense control vector concerned withthis invention.

FIG. 28 shows an example (WO2) of the tense control vector concernedwith this invention.

FIG. 29 shows an example (WO3) of the tense control vector concernedwith this invention.

FIG. 30 shows an example (WO4) of the tense control vector concernedwith this invention.

FIG. 31 explains the pallet function concerned with this invention.

FIG. 32 explains the tense control function (Φ₀) concerned with thisinvention.

FIG. 33 explains the tense control function (Φ₁) concerned with thisinvention.

FIG. 34 is a block diagram of a computer for implementing a firstportion of the present invention.

FIG. 35 is a block diagram of a computer for implementing a secondportion of the present invention.

BEST MODE FOR CARRYING OUT THE INVENTION

That is, with this invention, the definitive identifier is decided atfirst, which is the screen necessary to the software to be produced.Next, the homogeneity map is created, in which all pallets necessary tothe software based on the definitive identifiers are posted inaccordance with the process flow, while sorting out words existing withthe definitive identifier. Next, the necessary file is decided on thebasis of the sorted-out words and the created homogeneity map. Next, forall the sorted-out words, the first tense control vector to do screenedit or file edit, the second tense control vector to decide the processroute, and the third tense control vector to do file update are created.Next, per screen unit, the three kinds of pallets are created bydisposing the aforementioned first to third tense control vector, andinside each pallet, the pallet function is created, which willautonomously execute each tense control vector with significance. Then,the screen based on the pallet function concerned with the first tensecontrol vector is transmitted; the screen is received and the palletfunction concerned with the second tense control vector is executed; andin accordance with this execution result the aforementioned three palletfunctions are assembled into the tense control function having thestructure to decide one process route from plural process routesincluding at least one process route for the execution of the palletfunction concerned with the third tense control vector.

In the following, in order to detail this invention the explanation ispresented in accordance with the attached diagrams.

FIG. 1 is a diagram to indicate work steps by this invention.

That is, with this invention, a desired software can be created by thefollowing steps: to decide the definitive identifier (step 101), todecide the word (step 102), to create the homogeneity map (step 103), todecide the file (step 104), to create the tense control vector (step105), to create the pallet function (step 106), and to assemble into thetense control function (step 107).

Determination of the Definitive Identifier

For example, in the case of creating software called "sales input" inorder to enter sales at some company, the screen for the input of sales(FIG. 2) and the screen for referring to the customer codes (FIG. 3) aredecided. Not only the customer code reference screen but also thefollowing screens can also be established in accordance with needssimilar to this screen, including the staff code reference screen, thesales classification screen, the billing code screen, the product codescreen, etc.

Also, in the case of creating software called "arrival confirmationinput" in order to enter the confirmation of arrival of products at somecompany, the screen for the input of the confirmation of productarrivals (FIG. 4) and the screen for referring to the warehouse code(FIG. 5) are decided.

Also, in the case of creating software called a "delivery request list"to output a list of product delivery requests at some company, thescreen for executing output of the delivery request list (FIG. 6) andthe journals of the list (FIG. 7, FIG. 8) are decided.

Determination of the Word

The determination of the word means to sort out all words from the abovescreens and the journals, which were decided.

For example, in the screen FIG. 2 for the above "sales input," thefollowing words can be sorted out, including

OPCD

Sales No.

Sales Classification

Sales Date

Customer

Payment Due Date

Billing Destination

Consumption Tax

Name in charge

Slip Order No.

Delivery Place

Phone

Remarks

Product Code

Quantity

Unit Price

Discount

Amount

Product Name

Type of Machines/Media

Product SN

Sales Total

Consumption Tax

Discount Total

Sum Total

Execution

F1

F3

F4

F8

and these are the determined words.

Also, in the above "Refer to Customer Code" screen FIG. 3, the followingcan be sorted out:

No.

Customer (abbreviation)

Customer Name

Address

Name in charge

Selection No.

Customer Name--katakana

Old Code

Execution

F12

and these are the determined words.

Also, in the above "arrival confirmation input" screen FIG. 4, thefollowing can be sorted out:

OPCD

Warehouse Code

H/S Classification

Agency Classification

Execution

F1

F3

F4

and these are the determined words.

Also, in the above "arrival confirmation input" screen FIG. 5, thefollowing can be sorted out:

No.

Warehouse Code

Warehouse Name

Selection No.

Execution

F12

and these are the determined words.

Also, in the above "delivery request list" screen FIG. 6, the followingcan be sorted out:

Delivery Request Date, Execution

F2

F3

and these are the determined words.

Also, in the journals of the "delivery request list" FIG. 7 and FIG. 8,the following can be sorted out:

Department

Delivery Place

Billing Destination

Address 1

Address 2

Phone

Post 1

Name in charge

Store in charge

Delivery Request Date

Delivery No.

Product Code

Product Name

Quantity

Renewal

Date of Order Received

Order No.

Line

Name in charge of Order Received

Product SN

Date

Customer Order No.

Inst.

City

Delivery

Sales

and these are the determined words.

Creation of the Homogeneity Map

The homogeneity map is created on the basis of the determined definitiveidentifier.

The homogeneity map may be created humanly or mechanically.

The homogeneity map is what has been connected, by lines, with thepallet (indicated by a box) which corresponds to each screen eachjournal. The line means the pallet unit-team function. If the screen andthe journal are already decided, the connection between pallets isdetermined inevitably.

FIG. 9 is the homogeneity map for the above "sales input."

The 91 means the menu screen, and the "sales input" can be selected fromthe menu screen.

The 92 is the pallet WO4 for the screen to input sales (FIG. 2), and the93 is its pallet WO2.

The 94 is the pallet WO3 at the time of selecting the "execution" in thescreen for the input of sales.

The 95 is the pallet WO3 at the time of selecting the "registration" inthe screen for the input of sales, and the WFL (Work File area) 96 meansthe write to a file.

The 97 is the pallet WO4 for the screen (FIG. 3) at the time ofselecting the "reference" of the "customer code" in the screen for thesales input, the 98 is its pallet WO2.

When the "end" in the screen for the sales input is selected, it returnsto the menu.

In each pallet, the pallet classification at the upper part outside thebox, the name of the screen, the screen identification number at thelower part inside the box, and the determined file name (discussedlater) in the dot-line box at the bottom outside the box are describedrespectively.

At the upper of the line connecting pallets, the name of buttons("execution," "registration," etc.) selected in the previous screen andat the lower part of the line connecting pallets the absoluteclassification (R0-R5) of the process.

FIG. 10 is the homogeneity map for the "arrival confirmation input."

The 101 is the menu screen, and the "arrival confirmation input" can beselected from the menu screen.

The 102 is the pallet WO4 for the screen (FIG. 4) to enter the arrivalconfirmation, and the 103 is its pallet WO2.

The 104 is pallet WO4 for the warehouse code reference screen (FIG. 5)at the time of selecting the "reference" of the "warehouse code" in thescreen to enter the arrival confirmation, and the 105 is its pallet WO2.

When the "execution" is selected in the screen to enter the arrivalconfirmation, it returns to the screen to enter the arrivalconfirmation.

When the "registration" is selected in the screen to enter the arrivalconfirmation, the write to a file is executed via the WFL (Work FileArea) 106.

When the "end" is selected in the screen to enter the arrivalconfirmation, it returns to the menu screen.

FIG. 11 is a homogeneity map for the above "delivery request list."

The 111 is the menu screen, and the "delivery request list" can beselected from the menu screen.

The 112 is the pallet WO4 for the screen (FIG. 6) to output the deliveryrequest list, and the 113 is its pallet WO2.

When the "print" is selected in the screen to output the deliveryrequest list, the journal output (print) is executed via the WFL (WorkFile Area) 114.

When the "execution" is selected in the screen to output the deliveryrequest list, it returns to the screen to output the delivery requestlist.

When the "end" is selected in the screen to output the delivery requestlist, it returns to the menu screen.

As explained above, in the homogeneity map, for example, if some screenis determined the after-process in the screen will be inevitablydecided, including the process contents in the screen (execution,registration, etc.), then next necessitated process (screen display,journal output, file registration, file readout, operation, etc.).Therefore, in accordance with the above process contents, the lineconnection with the screen, etc. is provided.

Determination of the File

The necessary file is determined on the basis of the created homogeneitymap and the determined words. That is, the necessary file can inevitablybe decided from the homogeneity map and the word. The determined file isdescribed in the dot-line box, etc. at the lower part outside the box ofthe homogeneity map.

For example, it can inevitably be known from its homogeneity map and theword that, to the pallet WO2 Indicated by the code 93 of FIG. 9, thefollowing file is needed, including

Employee M (master file)

Name M

Customer Information F (file)

Department M

WO3-S/F

Product List F.

Creation of the Tense Control Vector

To create the tense control vector (program) for each word. That is, todo the decoding of the tense control vector for each word.

With the tense control vector, there are the following six elements:

WO4 duplicate vector

WO4 homogeneity vector

WO2 duplicate vector

WO2 homogeneity vector

WO3 duplicate vector

WO3 homogeneity vector

and six kinds of the tense control vector (program) are created per eachword. However, the WO2 duplicate vector is not always necessitated.

The explanation of the case of creating the tense control vector focusedon the word "sales" is presented here as an example.

The WO4 duplicate vector is created as shown by FIG. 12.

First, to make judgment whether a sales amount exists or not in the item(screen) of the corresponding WO2 sales (step 1201). If it exists, thesales amount is set to the item of the WO4 sales (step 1202), then theprocess is ended.

If it doesn't exist, the judgment is made whether a sales amount existsor not in the item of the WO3 sales (step 1203). If it exists, the salesamount is set to the item of the WO4 sales (step 1204), then the processis ended as is.

Depending upon the need of some words, a step for confirming thepresence of the execution shall be established before step 1202. Also, astep for confirming the presence of the establishment of the aimedprocess shall be established after step 1204, and if the aimed processbe not established, a flag is to be set for restarting the pallet.

To be important as that programs are always created with this structurefor any words, and it also applies to the following program.

The WO4 homogeneity vector is created as shown by FIG. 13.

First, to make judgment whether a sales amount was already entered intothe item of the WO4 sales (step 1301). If already entered, the processis ended.

If not already entered, the judgment shall be made whether the edit ofthe sales amount for the WO4 sales' item is possible or not (step 1302).That is, for example, assuming that the sales amount is the price x thenumber of pieces, the judgment shall be made whether a value alreadyexists or not in the item of the WO4 price and in the item of the WO4number of pieces. The edit is executed, if possible (for example, toobtain a sales from the existing price and the number of pieces) step1303). The edit result (for example, the obtained sales amount) shall beset to the item of the WO4 sales (step 1304).

When the edit cannot be executed, in accordance with the need (step1305), a flag is set for restarting the pallet (step 1306). That is, thedetermination of the sales amount is once reserved. Speaking of theabove example, the determination will be reserved until the input of theprice and the number of pieces. This means that the program concernedwith this invention is nothing but what autonomously determines thesignificance.

The WO2 homogeneity vector is created as shown by FIG. 14.

First, to make judgment whether a sales amount is already entered or not(whether it is already set to the item of the WO4 sales) (step 1401). Ifnot already entered, the process is ended.

If already entered, the input sales amount is set to the item of the WO2sales (step 1402), then the process is ended.

Depending upon the need of some words, a step for confirming thepresence of the execution shall be established before step 1401. Also, astep for confirming the presence of the establishment of the aimedprocess shall be established after step 1402, and if the aimed processbe not established, a flag is to be set for restarting the pallet.

Further, for example, in the case of the control word such as an"execution key," the above mentioned step 1402 will become the processfor setting the process route flag (See FIG. 15). The process route flag(R=0-5, however, R=0 is exceptional) is determined by the homogeneitymap. By this, as for the tense control function the process ofdistributing the route is made possible, as discussed later.

The WO3 duplicate vector is created as shown by FIG. 16.

First, to make judgment whether a sales amount is already entered or notto the item of the WO2 sales (step 1601). If already entered, the salesamount is set to the item of the WO3 sales (step 1602), then the processis ended.

If not already entered, the process is ended as is.

Depending upon the need of some words, a step for confirming thepresence of the execution shall be established before step 1601. Also, astep for confirming the presence of the establishment of the aimedprocess shall be established after step 1602, and if the aimed processbe not established, a flag is to be set for restarting the pallet.

The WO3 homogeneity vector is created as shown by FIG. 17.

First, to make judgment whether a sales amount is already entered or notto the item of the WO3 sales (step 1701). If already entered, theprocess is ended.

If not already entered, to make judgment whether the calculation ispossible or not (step 1703). That is, for example, assuming that thesales amount is the price x the number of pieces as above, the judgmentshall be made whether a value already exists or not in the item of theWO3 price and in the item of the WO3 number of pieces. Then, if theinduction is possible, the calculation is executed (for example, thesales is obtained from the existing price and the number of pieces)(step 1704). The calculated result (for example, the obtained salesamount) shall be set to the item of the WO3 sales (step 1705).

If the calculation cannot be executed, in accordance with the need (step1706), a flag is to be set for restarting the pallet (step 1707). Thatis, in this case, as the same as above, the determination of the salesamount is once reserved, and speaking of the above example, thedetermination will be reserved until the input of the price and thenumber of pieces. This means that the program concerned with thisinvention is nothing but what autonomously determines the significance.

Creation of the Pallet Function

To create the pallet function for WO4, WO2, WO3. FIG. 18 shows thestructure paradigm of the pallet function, each pallet function(program) can be created with the structure as shown.

First, to open a file (step 1801). That is, for example, as for thepallet function concerned with the WO4, a file shall be opened, from theplural WO4 pallets, by selecting the prescribed one concerned with W4pallet, and then execute each duplicate vector and homogeneity vector inconsecutive order (step 1802, step 1803).

Thereafter, in the case that the pallet start flag is set (step 1804),the flag is to be reset (step 1805), and each duplicate vector andhomogeneity vector shall be executed in consecutive order (step 1802,step 1803). That is, the pallet function enables autonomousdetermination of the program, jointly working with the pallet start flagof each pallet.

On the other hand, when the pallet start flag is not set, the file isclosed (step 1806) and the process is ended.

Assemble into the Tense Control Function

The structure of the tense control function is identical in anysoftware. Accordingly, the tense control vector and the pallet functionwhich were created as explained above can be simply assembled into thetense control function prepared in advance.

The structure paradigm of the tense control function is shown in FIG.19.

That is, to determine the transmission information (step 1901). Thetransmission information means the screen to display. For example, itcan be explained as follows, by referring to the homogeneity map shownin FIG. 9. For example, when the "reference" of the "customer code" inthe sales input's screen (See FIG. 2.) is selected (meaning that aprocess route flag of R=3 is established in the pallet WO2 of the"customer code."), the screen of the customer code reference (See FIG.3.) is determined as the transmission information.

When the transmission information contains the information of closingthe system (step 1902), the system is closed (step 1903). Theinformation of closing the system is, it can be explained as follows, byreferring to the homogeneity map shown in FIG. 9. For example, it meansthat The "F3" in the s ales input's screen (See FIG. 2.) was selected(meaning that a process route flag of R=0 is established in the palletWO2 of the "F3"). The meaning of closing the system is to return to themenu screen in the case of the above example.

Next, to make judgment whether to continue or not inside the WT unit(step 1904). This step is concerned with an exceptional process. Thatis, the WT unit means for example, as shown in FIG. 20, it isestablished by binding, as one unit, the registration screen used forthe data registration and the reference screen used for the datareference when the said data is registered. For example, it can beexplained as follows, by referring to the homogeneity map shown in FIG.9: The WT unit is what is established by binding, as one unit, the salesinput's screen (See FIG. 2.) and the customer code reference's screen(See FIG. 3.). However, when the screen of other homogeneity maps, forexample, of the arrival confirmation input (See FIG. 10, FIG. 4.) arenecessitated, these must be unit-teamed. Thereupon, as shown in FIG. 20,the scenario unit-team, i.e., the unit-team with other WT must beestablished (step 1905, step 1906). It will become particularlyeffective, when corresponding to a huge program.

In the case of the continuation inside the WT unit, to set all palletsof the said WT unit (step 1907). For example, by referring to thehomogeneity map shown in FIG. 9, all the pallets concerned with thiswhole process (WO2-WO4) are set onto the working memory, respectively.

Then, to execute the said pallet WO4 at first (step 1908). That is, toexecute the pallet WO4 in which all WO4 duplicate vectors and WO4homogeneity vectors have been set into the pallet function shown in FIG.18. By this step, the data concerned with the screen to display will bedetermined.

Then, to execute the transmission function (step 1909). That is, thescreen in which data, etc. have been shall be transmitted (to CRT as adisplay means, for example).

Thereafter, to execute the receive function (step 1910). That is, toreceive the screen, in which data, etc. was entered, (from CRT as adisplay means, for example).

Then, to make judgment whether the receive data is normal or not (step1911). If abnormal, do over again from the beginning. That is, to makejudgment if any illegal data, etc.

Next, to execute the said pallet WO2 (step 1912). That is, to executepallet WO2 in which all WO2 homogeneity vectors have been set into thepallet function shown by FIG. 18. By this step, the input data, etc.will be determined.

Next, the process route will be determined (step 1913, step 1914). Theprocess route is judged by the process route flag (R=1 to 5) placed onthe WO2 homogeneity vector, as explained above.

When the process route flag is R=1, the said pallet WO3 (the pallet WO3not accompanied by the registration to a file) shall be executed (step1915). For example, the line 94 of the pallet WO3 shown in FIG. 9 shallbe executed. Then, to return to the first step (step 1901). That is, theprocess route R=1 is a route process which only executes data process(See FIG. 9.).

When the process route flag is R=2, the said pallet WO3 (the pallet WO3accompanied by the registration to a file) shall be executed (step1916). For example, to execute the pallet WO3's line 95 and the WFL'sline 96, then to return to the first process (step 1901). The processroute R=2 is a process route to execute the data process execution andthe data registration to a file (See FIG. 9.).

When the process route flag is R=3 to 5, it returns to the first process(step 1901) as it is.

In this connection, the process route R=3 is a route process to returnto the pallet WO4 (both homogeneous and heterogeneous) as it is (SeeFIG. 9.).

The process route R=4 is a process to register the data to a file as itis (See FIG. 10.).

The process route R=5 is a process to take out the data from a file asit is (See FIG. 11.).

With the above mentioned method, the software concerned with thisinvention can be created. Here, by showing the traditional method inFIG. 21, the method of this invention shown in FIG. 1 is compared. Whenthe work steps of the traditional method steps 2101 to 2103 and the thisinvention's method step 101 to 104 are compared, this invention's methodbecomes approximately one-fifth (1/5) work steps, and when the worksteps of the traditional method steps 2104 to 2106 and the thisinvention's method step 105 to 107 are compared, this invention's methodbecomes approximately one-tenth (1/10) to one-fifteenth (1/15) worksteps.

FIG. 22 shows the conceptual structure of the program concerned withthis invention. That is, the plural of the pallet WO2 (each palletincludes k pieces of l_(i),2 and k pieces of L_(i),2.), the pallet WO3(each pallet includes k pieces of l_(i),3 and k pieces of L_(i),3.), andthe pallet WO4 (each pallet includes k pieces of l_(i),4 and k pieces ofL_(i),4) are assembled into the pallet function (Φ_(p)) respectively,and then assembled into the tense control function (Φ₀). That is, it isknown that the following formula has been established.

    T.sub.0 =Φ.sub.0 ({Φ.sub.p {l.sub.i,2,L.sub.i,2 }}.sub.k +{Φ.sub.p {l.sub.i,3,L.sub.i,3 }}.sub.k +{Φ.sub.p {l.sub.i,4,L.sub.i,4 }}.sub.k)

FIG. 24 shows the structure of the mean-space model of the case thateven the traditional program can be made suitable to the LYEE's ruling,which will appear in the pallet of the tense control function Φ₀ takingthe base definitive as a screen. That is, the replacement into T₁ takesplace by the tense control function Φ₀ (multiple) which takes the basedefinitive of the traditional program (multiple) as a file, and thestructure will be ruled by the pallet Φ₀ in which the program appeared.

FIG. 33 is a flow chart which shows the program for equally handling thetraditional program and the tense control vector, that is, the tensecontrol function Φ₁ for making the traditional program suitable to theLYEE's ruling. The program of FIG. 33 is similarly assembled into thepallet function as the tense control vector.

Industrial Applicability

The problem of the traditional software development work has beenattributed to the extremely high level of the dependency on personalabilities and it was sought for to all staff members. This invention hasmade it a development methodology, by theoretically grasping theconsciousness action existing in the depths of the thinking method inrelation to the cognitive action, and it is applicable, irrespective offield, to such as OS's, middle games, controls, business, etc.

Since the software structure which is induced by this invention isdetermined theoretically, it is recurrent and becomes the one and only.As a result, the software developed is not a black box any more,excluding human errors from the quality viewpoint, while the structurebecoming strong with the clear structure. Therefore, the estimation canbe realized more accurately, and the development planning anddevelopment management will be made easier to perform.

Additionally, in comparison with the traditional method, the developmentterm becomes 1/2 to 1/4, the development cost becomes 1/3 to 1/5, theproductivity of the development staff becomes 10 to 15 times, the volumeof development documents becomes 1/15 to 1/20, etc. All figures aremiraculously significant. In addition, the efficiency of the maintenancereaches 50 to 70 times.

With the traditional method, it is known that the productivity of themaintenance is approximately 1/10 of the productivity of the developmentwork. With this invention, it is equivalent to the productivity of thedevelopment work, therefore the productivity of ten times theproductivity of the development staff will become the productivity ofthe maintenance. To be noted, the productivity of the development staffis a production comparative value against the traditionally called workprocess, i.e., all work areas inclusive of requirement definition, basicdesigning, detail designing, programming, and verification, therefore,the aforementioned figure is a value representing the case that the workarea concept of the maintenance work is applied to a half of its sphere.

What is claimed is:
 1. A computer-implemented software productionmethod, performed on a computer, comprising:(a) determining a userinterface; directly identifying software to be produced (b) picking outa word from the user interface; (c) creating a homogeneity map in whichall pallets necessary to the software are arranged in accordance with aprocess flow based on the user interface; (d) determining necessaryfiles based on said word picked out and said homogeneity map created;(e) creating, for said word, a WO4 duplicate vector and a WO4homogeneity vector for executing a screen edit, a WO2 duplicate vectorand a WO2 homogeneity vector for determining a process route, and a WO3duplicate vector and a WO3 homogeneity vector for executing a fileupdate; (f) creating WO4, WO2, and WO3 pallets; (g) creating WO4, WO2,and WO3 pallet functions for executing said WO4, WO2, and WO3 duplicateand homogeneity vectors in the WO4, WO2, and WO3 pallets and forre-executing corresponding duplicate and homogeneity vectors when apallet restart flag in a corresponding pallet is set; and (h) assemblingthe WO4, WO2, and WO3 pallet functions into a tense control function,the tense control function controlling the sub-steps of transmittingdata from the user interface based on the WO4 pallet function, receivingresponse screen data, executing the WO2 pallet function, determining aprocess route in accordance with a process route flag of the WO2 pallet,and executing the WO3 pallet function according to the determinedprocess route.
 2. The method as claimed in claim 1, wherein the word ofthe user interface comprises a text field to be filled in.
 3. Acomputer-based processing apparatus, comprising:user interface means,including a WO4 pallet including a WO4 duplicate vector and a WO4homogeneity vector for interacting with a word of a user interface;process route determining means, including a WO2 pallet including a WO2duplicate vector and a WO2 homogeneity vector; file updating means,including a WO3 pallet including a WO3 duplicate vector and a WO3homogeneity vector; means for executing said WO4, WO2, and WO3 duplicateand homogeneity vectors in the WO4, WO2, and WO3 pallets, respectively,and for reexecuting said WO4, WO2, and WO3 duplicate and homogeneityvectors in the WO4, WO2, and WO3 pallets, respectively, when a palletrestart flag in the corresponding pallet is set; and means fortransmitting data from the user interface based on the WO4 palletfunction, receiving response screen data, executing the WO2 palletfunction, determining a process route in accordance with a process routeflag of the WO2 pallet, and executing the WO3 pallet function accordingto the determined process route.
 4. The apparatus as claimed in claim 3,wherein the word of the user interface comprises a text field to befilled in.
 5. A computer-based code generating apparatus,comprising:means for receiving a user interface as specified by a user,said user interface including a word and a WO4 pallet including a WO4duplicate vector and a WO4 homogeneity vector; means for generating aprocess route determining means, including a WO2 pallet including a WO2duplicate vector and a WO2 homogeneity vector; and means for generatinga file updating means, including a WO3 pallet including a WO3 duplicatevector and a WO3 homogeneity vector.